A Time Index Based Approach for Cache Sharing in Mobile Adhoc Networks

نویسنده

  • Lilly Sheeba
چکیده

Initially wireless networks were fully infrastructure based and hence imposed the necessity to install base station. Base station leads to single point of failure and causes scalability problems. With the advent of mobile adhoc networks, these problems are mitigated, by allowing certain mobile nodes to form a dynamic and temporary communication network without any preexisting infrastructure. Caching is an important technique to enhance the performance in any network. Particularly, in MANETs, it is important to cache frequently accessed data not only to reduce average latency and wireless bandwidth but also to avoid heavy traffic near the data centre. With data being cached by mobile nodes, a request to the data centre can easily be serviced by a nearby mobile node instead of the data centre alone. In this paper we propose a system , Time Index Based Approach that focuses on providing recent data on demand basis. In this system, the data comes along with a time stamp. In our work we propose three policies namely Item Discovery, Item Admission and Item Replacement, to provide data availability even with limited resources. Data consistency is ensured here since if the mobile client receives the same data item with an updated time, the previous content along with time is replaced to provide only recent data. Data availability is promised by mobile nodes, instead of the data server. We enhance the space availability in a node by deploying automated replacement policy.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proactive Approach for Cooperative Caching in Mobile Adhoc Networks

In Mobile Adhoc Networks (MANETs), due to frequent network partition, data availability is lower than that in traditional wired networks. Cooperative caching provides an attractive solution for this problem. In this paper we propose a new proactive approach for cooperative caching in MANETs, in which we will cache the data of leaving node. Here each mobile node will broadcast a “LEAVE” message ...

متن کامل

Cluster Based Data Consistency for Cooperative Caching over Partitionable Mobile Adhoc Network

Problem statement: Data availability and consistency are foremost issues in Mobile Ad hoc Networks due to the absence of permanent infrastructure. Cooperative caching addresses the data availability issue through coordinating the mobile nodes and sharing the cache copies among them. In the meantime, the mobile node must ensure the staleness of cache copies. The consistency maintenance resolves ...

متن کامل

Implementation and Testing of Peer to Peer Web Caching Technique for Mobile Ad-Hoc Network

In Mobile AdHoc Networks, web caching is the challenging job due to its moving nature of nodes. So we analyze one technique for web caching in Mobile Ad Hoc Networks. MANET stands for Mobile Ad Hoc Network which is an evolving concept. In the development various researches the different aspects of MANET are focused such as routing and caching of data. Among them, the lack of efforts done on web...

متن کامل

Performance Characteristics of Cluster –Based Multicast Key Distribution Scheme for Mobile ADHOC Networks

Many emerging commercial and military applications require secure multicast communication in adhoc environments. Secure multicast communication in mobile adhoc networks is challenging due to its inherent characteristics of infrastructure-less architecture with lack of central authority, high packet loss rates and limited resources such as bandwidth, time and power. Hence key management is the f...

متن کامل

A Gravitational Search Algorithm-Based Single-Center of Mass Flocking Control for Tracking Single and Multiple Dynamic Targets for Parabolic Trajectories in Mobile Sensor Networks

Developing optimal flocking control procedure is an essential problem in mobile sensor networks (MSNs). Furthermore, finding the parameters such that the sensors can reach to the target in an appropriate time is an important issue. This paper offers an optimization approach based on metaheuristic methods for flocking control in MSNs to follow a target. We develop a non-differentiable optimizati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011